Weighted priority queueing is a modification of priority queueing that eliminates\nthe possibility of blocking lower priority traffic. The weights assigned to\npriority classes determine the fractions of the bandwith that are guaranteed\nfor individual traffic classes, similarly as in weighted fair queueing. The paper\ndescribes a timed Petri net model of weighted priority queueing and uses discrete-\nevent simulation of this model to obtain performance characteristics of\nsimple queueing systems. The model is also used to analyze the effects of finite\nqueue capacity on the performance of queueing systems.
Loading....